Three dimensional object pose estimation which employs dense depth information

ABSTRACT

Dense range data obtained at real-time rates is employed to estimate the pose of an articulated figure. In one approach, the range data is used in combination with a model of connected patches. Each patch is the planar convex hull of two circles, and a recursive procedure is carried out to determine an estimate of pose which most closely correlates to the range data. In another aspect of the invention, the dense range data is used in conjunction with image intensity information to improve pose tracking performance. The range information is used to determine the shape of an object, rather than assume a generic model or estimate structure from motion. In this aspect of the invention, a depth constraint equation, which is a counterpart to the classic brightness change constraint equation, is employed. Both constraints are used to jointly solve for motion estimates.

This disclosure is based upon, and claims priority from, provisional U.S. Patent Application No. 60/123,329, filed Mar. 8, 1999, and provisional U.S. Patent Application No. 60/124,158, filed Mar. 10, 1999, the contents of which are incorporated herein by reference.

FIELD OF THE INVENTION

The present invention is generally directed to the field of computer vision, and more particularly to the automatic estimation and tracking of the pose, i.e., position and/or orientation, of an object within a video image.

BACKGROUND OF THE INVENTION

The ability to accurately estimate the three-dimensional position and orientation of an object, based solely upon video images of the object, is of increasing interest in the field of computer vision. For example, interactive human interface applications require the ability to quickly and accurately track the pose of a user. Information regarding the user's body position must be at or near real-time, to adjust the display of the interface in a meaningful, timely manner. For instance, an application which displays a three-dimensional view of an object requires accurate tracking of the position and orientation of the user's head, in order to present the frames containing an image of the object from an appropriate perspective.

In general, previous approaches to pose tracking often relied on assumed models of shape, to track motion in three dimensions from intensity data, i.e., image brightness. Other approaches have employed depth data in conjunction with the image brightness information to estimate pose. Direct parametric motion has also been explored for both rigid and affine models. In this approach, it is preferable to utilize constraints in the analysis of the image data, to reduce the number of computations that are required to estimate the pose of a figure. A comprehensive description of brightness constraints that are implied by the rigid motion of an object was presented by Horn and Weldon, “Direct Methods for Recovering Motion”, International Journal of Computer Vision 2:51–76 (1998). Image stabilization and object tracking using an affine model with direct image intensity constraints is described in Bergen et al., “Hierarchical Model-Based Motion Estimation”, European Conference on Computer Vision, pages 237–252 (1992). This reference discloses the use of a coarse-to-fine algorithm to solve for large motions. The application of affine models to track the motion of a user's head, as well as the use of non-rigid models to capture expression, is described in Black and Yacoob, “Tracking and Recognizing Rigid and Non-Rigid Facial Motions Using Local Parametric Models of Image Motion,” International Conference on Computer Vision (1995). This paper describes the use of a planar face-shape for tracking gross head motion, which limits the accuracy and range of motion that can be captured. A similar approach, using ellipsoidal shape models and perspective projection, is described in Basu et al., “Motion Regularization for Model-Based Head Tracking”, International Conference on Pattern Recognition (1996). The method described in this publication utilizes a pre-computed optic flow representation, instead of direct brightness constraints. It explicitly recovers rigid motion parameters, rather than an affine motion in the image plane. Rigid motion is represented using Eular angles, which can pose certain difficulties at singularities. The tracking of articulated-body motion presents additional complexities within the general field of pose estimation. A variety of different techniques have been proposed for this particular problem. Some approaches use constraints from widely separated views to disambiguate partially occluded motions, without computing depth values. Examples of these approaches are described, for example, in Yamamoto et al., “Incremental Tracking of Human Actions From Multiple Views”, Proc. IEEE CVPR, pages 2–7, Santa Barbara, Calif. (1998), and Gavrila and Davis, “3D Model-Based Tracking of Humans in Action: A Multi-View Approach”, Proc. CVPR, pages 73–80, San Francisco, Calif. (June 1996). The use of a twist representation for rigid motion, which is more stable and efficient to compute, is described in Bregler and Malik, “Tracking People With Twists and Exponential Maps”, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Santa Barbara, Calif. (June 1998). This approach is especially suited to the estimation of chained articulated motion. The estimation of twist parameters is expressed directly in terms of an image brightness constraint with a scaled orthographic projection model. It assumes a generic ellipsoidal model of object shape. To recover motion and depth, constraints from articulation and information from multiple widely-spaced camera views is used. This method is not able to estimate the rigid translation in depth of an unconnected object, given a single view. The techniques which exhibit the most robustness tend to fit the observed motion data to a parametric model before assigning specific pointwise correspondences between successive images. Typically, this approach results in non-linear constraint equations which must be solved using iterative gradient descent or relaxation methods, as described in Pentland and Horowitz, “Recovery of Non-Rigid Motion and Structure”, PAMI, 13(7), pp. 730–742 (July 1991), and Lin, “Tracking Articulated Objects in Real-Time Range Image Sequences”, Proc. IEEE ICCV, Volume 1, pages 648–653, Greece (September 1999). The papers by Bregler et al. and Yamamoto et al. provide notable exceptions to this general trend. Both result in systems with linear constraint equations, that are created by combining articulated-body models with dense optical flow.

In the approach suggested by Yamamoto et al., the constraints between limbs are maintained by sequentially estimating the motion of each parent limb, adjusting the hypothesized position of a child limb, and then estimating the further motion of the child limb. This approach is conceptually simpler than the one suggested by Bregler et al., but results in fewer constraints on the motion of the parent limbs. In contrast, the method of Bregler et al. takes full advantage of the information provided by child limbs, to further constrain the estimated motions of the parents. Both Yamamoto et al. and Bregler et al. use a first-order Taylor series approximation to the camera-body rotation matrix, to reduce the number of parameters that are used to represent this matrix. Furthermore, both use an articulated model to generate depth values that are needed to linearize the mapping from three-dimensional body motions to observe two-dimensional camera-plane motions. The various techniques which employ depth information to estimate pose have typically utilized sparse depth data, e.g. representative sample points in an image. Recent imaging techniques now make it possible to obtain dense depth information, e.g. a depth value for all, or almost all, of the pixels in an image. Furthermore, this data can be obtained at video rates, so that it is real-time, or near real-time. It is an objective of the present invention to provide techniques for estimating pose which employ dense depth data.

SUMMARY OF THE INVENTION

In accordance with one aspect of the present invention, dense depth data that is obtained at real-time rates is employed to estimate the pose of an articulated figure, using a model of connected patches. In another aspect of the invention, the dense depth data is used in conjunction with image intensity information to improve pose tracking performance. The range information is used to determine the shape of an object, rather than assume a generic model or estimate structure from motion. The shape data can be updated with each frame, offering a more accurate representation across time than one which is provided by an initial, or off-line, range scan. In accordance with this feature of the invention, a depth constraint equation, which is a counterpart to the classic brightness change constraint equation, is employed. Both constraints are used to jointly solve for motion estimates. By observing the change in depth directly, rather than inferring it from intensity change over time, more accurate estimates of object motion can be obtained, particularly for rotation out of the image plane and translation in depth. Depth information is also less sensitive to illumination and shading effects than intensity data as an object translates and rotates through space. Hence, the dense depth data is frequently more reliable than the brightness information. In the case of articulated joints, twist mathematics are used to capture the motion constraints. Unlike previous approaches, a first-order Taylor series expansion is not employed to approximate the body-rotation matrix. Rather, this approximation is achieved by solving the constraints on a transformed parameter set, and remapping the results into the original parameter set using a closed-form non-linear function. As a further feature of the invention, the brightness change constraint equation and the depth change constraint equation are re-derived, using shifted foci of expansions. This extension permits the constraints to be used on large motions without iteration. The constraint matrices are also modified to decouple the updates of body rotation and body translation from one another.

These and other features of the invention are described in greater detail hereinafter, with reference to various examples that are illustrated with the assistance of the accompanying figures.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic illustration of a pose estimation system in which the present invention can be employed;

FIG. 2 is a block diagram of an image processor in accordance with one aspect of the invention;

FIGS. 3 a and 3 b are illustrations of a planar patch model for a single segment and two articulated segments of a figure, respectively;

FIG. 4 is a graph depicting the function for observed farness;

FIG. 5 is a graph depicting the function for expected farness; and

FIG. 6 illustrates a method for estimating the pose of an articulated figure, in accordance with an embodiment of the invention.

DETAILED DESCRIPTION

To facilitate an understanding of the invention, it is described hereinafter with reference to its application in the context of estimating and tracking the pose of an articulated object, such as the human body, since this example presents a particularly interesting and useful application of the invention. It will be appreciated, however, that the practical utility of the invention is not limited to this particular situation. Rather, the invention can be employed with success in a variety of different situations, such as the estimation of the pose of singular rigid objects.

In the implementation of the invention, the pose of a figure is estimated by determining a reference, or initial pose, and then tracking changes over successive images to obtain an updated estimate of the pose. In the context of the following description, the term “pose” is employed in a generic sense, to indicate either or both of the position of the object within a three-dimensional space, and the orientation of the object at that position, e.g., the rotational position of the object, or individual components of the object, relative to three orthogonal axes. In other words, the term “pose” encompasses motion in any or all of six degrees of freedom, namely translation along three orthogonal axes and rotation about three orthogonal axes. It will be appreciated that the invention can be applied to estimate only the position of the object, without regard to its orientation, or only the orientation of the object, without regard to its global position.

FIG. 1 schematically illustrates one example of a pose estimation system in which the present invention can be implemented. An object whose pose is to be estimated and tracked, such as a human body 10, is located within the field of view of a pair of spaced video cameras 12 a and 12 b, which provide a sequence of stereo images of the object. One of the cameras, e.g., camera 12 a, is designated as a reference, or master, camera. Data describing the intensity of each of the pixels in the image sensed by this camera is provided to an image processor 14. The image data from both of the cameras is provided to a range processor 16. The range processor computes the distance of each point on the object from a reference position, such as the image plane of the reference camera, and provides this information to the image processor 14. In general, each point on the object corresponds to a pixel within the image sensed by the reference camera. In a preferred embodiment of the invention, the stereo pair of cameras and the range processor 16 constitute a video-rate range sensor of the type described in Woodfill and Von Herzen, “Real-Time Stereo Vision on the PARTS Reconfigurable Computer”, Proceedings IEEE Symposium on Field-Programmable Custom Computing Machines, Napa, Calif., pages 242–250 (April 1997). In this type of system, the correspondence between pixels in the respective images from the two cameras 12 a and 12 b is computed according to the census algorithm, as described in detail in Zabih and Woodfill, “Non-Parametric Local Transforms for Computing Visual Correspondence”, Proceedings of the Third European Conference on Computer Vision, Stockholm, pages 151–158, May 1994. The disclosures of both of these publications are incorporated herein by reference. The output of such a system comprises a depth value for each pixel in the image from the reference camera 12 a, together with a confidence factor for the value. The range information which is provided by such a system is dense data. In the context of the present invention, “dense” data is understood to mean data obtained from a predefined, fixed sampling grid that is independent of the parameter being determined, such as the pose of the figure. In a preferred implementation of the invention, the sample grid comprises the array of pixels on the image sensing device, e.g. CCD, of the camera. In this case, each pixel provides one sample of depth data. Rather than employ the data from every pixel, it is also possible to obtain depth data with a different resolution by means of a coarser, but regular, sampling grid that is established a priori, e.g. every 2nd pixel, every 5th pixel, etc. The data is also dense in the temporal sense, i.e. it is obtained at a regular sampling interval, such as a video frame rate.

Within the image processor 14, frame-to-frame changes in the image intensity and/or depth information are used to track the motion of the object and thereby estimate its pose. Three-dimensional motion of each point in space induces a corresponding two-dimensional motion of the projection of that point onto the image plane of the camera. In accordance with the invention, two different approaches are employed to estimate the pose from the camera outputs. One approach utilizes the range data alone, and employs a shape model to determine the figure's pose. In the other approach, both brightness information and range data are employed, without reference to a shape model. The pose estimate is obtained by computing the velocity of each point on the object from frame to frame. In the following description, capital letters are employed to represent parameter values in the three-dimensional space, and lower case values are employed for the corresponding parameters in the two-dimensional image plane. Hence, the coordinates of a point in three-dimensional space is expressed as [X,Y,Z], and its corresponding point in the camera image plane is identified as [x,y].

Before describing the manner in which dense depth data is employed to estimate pose in accordance with the invention, a background discussion of the use of brightness data in the image processor 14 is presented. The velocity of a point in the video image is computed in accordance with a standard brightness change constraint equation for image velocity estimation. This equation arises from the assumption that intensities undergo only local translations from one frame to the next in an image sequence. This assumption does not hold true for all points in the image, however, since it ignores phenomena such as object self-occlusion, i.e., a portion of the object disappears from view as it rotates away from the camera, and changes in intensity due to changes in lighting, e.g., the object moves into a shadow.

The brightness change constraint equation can be expressed as follows, for image frames at times t and t+1: B(x,y,t+1)=B(x−v _(x),y−v_(y) ,t)  (1) where B(x,y,t) is the image brightness, or intensity, at time t, and v_(x) and v_(y) are the motions in X and Y, after projection onto the image plane. If it is assumed that the time-varying image intensity is well approximated by a first-order Taylor series expansion, the right side of Equation 1 can be expanded to obtain: B(x,y,t+1)˜B(x,y,t)−v_(x) B _(x)(x,y,t)−v_(y) B _(y)(x,y,t)  (2) where B_(x)(x,y,t) and B_(y)(x,y,t) are image intensity gradients with respect to x and y as a function of space and time. Rearranging these terms into matrix form yields a commonly employed gradient formulation of the brightness change constraint equation: $\begin{matrix} {{- B_{t}} = {\begin{bmatrix} B_{x} & B_{y} \end{bmatrix}\;\begin{bmatrix} v_{x} \\ v_{y} \end{bmatrix}}} & (3) \end{matrix}$

This equation can be used to estimate image plane velocities, but 3-D real-world velocities are desired. For a perspective camera with focal length f, the relationship between the two sets of velocities may be derived from the perspective camera projection equations ${x = \frac{fX}{Z}},{{{and}\mspace{20mu} y} = {\frac{fY}{Z}.}}$ Taking the derivatives of these equations with respect to time yields $\begin{matrix} {{v_{x} = {\frac{\mathbb{d}x}{\mathbb{d}t} = {{\frac{f}{Z}V_{X}} - {\frac{x}{Z}V_{Z}}}}}{v_{y} = {\frac{\mathbb{d}y}{\mathbb{d}t} = {{\frac{f}{Z}V_{Y}} - {\frac{y}{Z}V_{Z}}}}}} & (4) \end{matrix}$ This can be written in matrix form as $\begin{matrix} {\begin{bmatrix} v_{x} \\ v_{y} \end{bmatrix} = {{\frac{1}{Z}\begin{bmatrix} f & 0 & {- x} \\ 0 & f & {- y} \end{bmatrix}}\;\begin{bmatrix} V_{X} \\ V_{Y} \\ V_{Z} \end{bmatrix}}} & (5) \end{matrix}$ The right side of the above equation can be substituted into Equation 3 to obtain the constraint equation in terms of 3-D object velocities: $\begin{matrix} \begin{matrix} {{- B_{t}} = {\frac{1}{Z}\begin{matrix} \left\lbrack B_{x} \right. & {{\left. B_{y} \right\rbrack\;\begin{bmatrix} f & 0 & {- x} \\ 0 & f & {- y} \end{bmatrix}}\overset{\rightarrow}{V}} \end{matrix}}} \\ {= {{\frac{1}{Z}\begin{bmatrix} {fB}_{x} & {fB}_{y} & {- \left( {{xB}_{x} + {yB}_{y}} \right)} \end{bmatrix}}\overset{\rightarrow}{V}}} \end{matrix} & (6) \end{matrix}$ where {right arrow over (V)}=[V_(X)V_(Y)V_(Z)]^(T). The 3-D object velocities {right arrow over (V)} are then further constrained according to rigid body object motion. Any rigid body motion can be expressed in terms of the instantaneous object translation {right arrow over (P)}=[P_(X)P_(Y)P_(Z) ]^(T) and the instantaneous rotation of the object about an axis {right arrow over (Ω)}=[ω_(x)ω_(Y)ω_(Z)]^(T). {right arrow over (ω)} describes the orientation of the axis of rotation, and |{right arrow over (ω)}| is the magnitude of rotation per unit time. For small rotations, {right arrow over (V)}={right arrow over (T)}+{right arrow over (Ω)}×{right arrow over (X)}={right arrow over (T)}−{right arrow over (X)}×{right arrow over (Ω)}  (7) The cross-product of two vectors may be rewritten as the product of a skew-symmetric matrix and a vector. Applying this to the cross product X×Q results in: ${{\overset{\rightarrow}{X} \times \overset{\rightarrow}{\Omega}} = {\hat{X}\;\overset{\rightarrow}{\Omega}}},\;{{{where}\mspace{14mu}\hat{X}} = \begin{bmatrix} {0} & {- Z} & {Y} \\ {Z} & {0} & {- X} \\ {- Y} & {X} & {0} \end{bmatrix}}$

Equation 7 can be rearranged into the convenient matrix form V=Q{right arrow over (φ)}  (8) by defining the motion parameter vector φ as [{right arrow over (T)} {right arrow over (Ω)}]^(T), and defining the matrix $\begin{matrix} {Q = {\begin{bmatrix} I & {- \hat{X}} \end{bmatrix} = \begin{bmatrix} 1 & 0 & 0 & {0} & {Z} & {- Y} \\ 0 & 1 & 1 & {- Z} & {0} & {X} \\ 0 & 0 & 1 & {Y} & {- X} & {0} \end{bmatrix}}} & (9) \end{matrix}$

The Q matrix may also be written in terms of image x and y coordinates, instead of 3-D world X and Y coordinates, in order to be consistent with the constraint equation as derived thus far: $\begin{matrix} {Q = \begin{bmatrix} 1 & 0 & 0 & {0} & Z & \frac{- {Zy}}{f} \\ 0 & 1 & 0 & {- Z} & 0 & \frac{Zx}{f} \\ 0 & 0 & 1 & \frac{Zy}{f} & \frac{- {Zx}}{f} & 0 \end{bmatrix}} & (10) \end{matrix}$

Using either form of Q, substitution of the right side of Equation 8 for {right arrow over (V)} in Equation 6 produces a single linear equation relating image intensity derivatives to rigid body motion parameters under perspective projection at a single pixel: $\begin{matrix} {{- B_{t}} = {{\frac{1}{Z}\begin{bmatrix} {fB}_{x} & {fB}_{y} & {- \left( {{xB}_{x} + {yB}_{y}} \right)} \end{bmatrix}}Q\;\overset{\rightarrow}{\phi}}} & (11) \end{matrix}$

Since video-rate depth information is available via the range processor 16, in accordance with the present invention changes in the depth image over time can be related to rigid body motion in a manner similar to that shown for intensity information above, and employed in the image processor 14 to estimate pose. For rigid bodies, an object point which appears at a particular image location (x, y) at time t will appear at location (x+v_(X), y+v_(Y)) at time t+1. The depth values at these corresponding locations in image space and time should therefore be the same, except for any depth translation the object point undergoes between the two frames. This can be expressed in a form similar to Equation 1: Z(x,y,t)+V _(Z)(x,y,t)=Z(x+v _(x)(x,y,t),y+v _(y)(x,y,t),t+1)  (12) The same series of steps described above for deriving the brightness constraint on rigid body motion can now be used to derive an analogous linear depth change constraint equation on rigid body motion. First-order Taylor series expansion, followed by rearrangement into matrix form, produces $\begin{matrix} {{- Z_{t}} = {{\begin{bmatrix} Z_{x} & Z_{y} \end{bmatrix}\;\begin{bmatrix} v_{x} \\ v_{y} \end{bmatrix}} - V_{Z}}} & (13) \end{matrix}$

Use of perspective camera projection to relate image velocities to 3-D world velocities yields $\begin{matrix} \begin{matrix} {{- Z_{t}} = {{{{\frac{1}{Z}\begin{bmatrix} Z_{x} & Z_{y} \end{bmatrix}}\begin{bmatrix} f & 0 & {- x} \\ 0 & f & {- y} \end{bmatrix}}\overset{\rightarrow}{V}} - V_{Z}}} \\ {= {\frac{1}{Z}\begin{matrix} \left\lbrack {fZ}_{x} \right. & {\left. {{fZ}_{y}\mspace{14mu} - \left( {Z + {xZ}_{x} + {yZ}_{y}} \right)} \right\rbrack\overset{\rightarrow}{V}} \end{matrix}}} \end{matrix} & (14) \end{matrix}$

Finally, 3-D world velocities are constrained to rigid body motion by introducing the Q matrix $\begin{matrix} {{- Z_{t}} = {\frac{1}{Z}\begin{matrix} \left\lbrack {fZ}_{x} \right. & {\left. {{fZ}_{y}\mspace{14mu} - \left( {Z + {xZ}_{x} + {yZ}_{y}} \right)} \right\rbrack Q\overset{\rightarrow}{\phi}} \end{matrix}}} & (15) \end{matrix}$ This linear equation for relating depth gradient measurements to rigid body motion parameters at a single pixel is the depth analog to Equation 11.

In many applications, it is possible to approximate the camera projection model as orthographic instead of perspective without introducing significant error in 3-D world coordinate estimation. For pose tracking algorithms, use of orthographic projection simplifies the constraint equations derived previously, making the solution of linear systems of these equations much less computationally intensive.

To derive the orthographic analogs of Equations 11 and 15, the perspective projection relationship is replaced with the orthographic projection equations x=X and y=Y, which in turn imply that v_(x)=V_(x) and v_(y)=V_(y). Hence, Equation 5 is replaced by the simpler equation $\begin{matrix} {\begin{bmatrix} v_{x} \\ v_{y} \end{bmatrix} = {\begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \end{bmatrix}\overset{\rightarrow}{V}}} & (16) \end{matrix}$

Proceeding through the remainder of the derivation of Equation 11 yields its orthographic projection analog: −B _(t) =[B _(x) B _(y)0]Q{right arrow over (φ)}  (17) Similar modification to the derivation of the depth change produces the orthographic counterpart to Equation 15: −Z _(t) =[Z _(x) Z _(y)−1]Q{right arrow over (φ)}  (18)

At each time step, registered intensity and depth images are obtained. Intensity and depth gradients are computed with respect to image coordinates x and y, and with respect to time, at each pixel location. Intensity and depth constraint equations of the form of (11) and (15) can be written for each pixel location. Because the intensity constraint equations (11) are linear, they can be combined across N pixels by stacking the equations in matrix form: H_(I){right arrow over (φ)}_(I)={right arrow over (b)}_(I).

H_(I) ε

^(V×6), where each row is the vector obtained by multiplying out the right side of Equation 12 at a single pixel i. {right arrow over (b)}_(I) ε

^(N×1), where the ith element is −B_(t) at pixel i. The I subscripts on the variables indicate that they reflect only the use of intensity constraints. Provided that N>6, this system of linear equations will over-constrain the motion parameters {right arrow over (φ)}_(I) so that they can be solved by the least-squares method: {right arrow over (φ)}_(t)=−(H _(I) ^(T) H _(I))⁻¹ H _(I) ^(T) {right arrow over (b)} _(I)  (19)

The linear depth constraint equations can be combined similarly across N pixels to form the linear system H_(D){right arrow over (φ)}_(D) ={right arrow over (b)} _(D), where H_(D) ε

^(N×6), {right arrow over (b)}_(z) ε

^(V×1), and the elements of H_(D) and {right arrow over (b)}_(D) are derived from Equation 15 in a manner analogous to that explained for the intensity linear system above. The D subscripts on the variables indicate that they reflect only the use of depth constraints. Provided that N>6, the motion parameters {right arrow over (φ)}_(D) can be solved according to the least-squares method, as in Equation 19.

The intensity and depth linear systems can be combined into a single linear system for constraining the motion parameters {right arrow over (φ)}: H{right arrow over (φ)}={right arrow over (b)}, where H=[H_(I)λH_(D)]^(T), and {right arrow over (b)}=[{right arrow over (b)}_(I) λ{right arrow over (b)}_(D)]^(T).

The scaling factor, λ, provides control over the weighting of depth constraints relative to intensity constraints. In cases where depth can be expected to be more reliable than intensity, such as under fast-changing lighting conditions, it is preferable to set λ to a value higher than 1, but under other conditions, such as when depth information is much noisier than intensity, lower λ values are preferably used. The least-squares solution to the above equation is {right arrow over (φ)}=−(H ^(T)H)⁻¹ H ^(T) {right arrow over (b)}  (20) To estimate the motion of an object, it is preferable to combine the constraint equations only across pixel locations which correspond to the object, and for which intensity, depth, and their derivatives are well-defined. To do this, a support map w(x,y)ε[0,1] is used which indicates the probability that each pixel corresponds to the object of interest and that its measurements and derivatives are reliable. The least-squares solution is modified to weight the contribution of the constraint from pixel location (x,y) according to w(x,y): {right arrow over (φ)}=−(H ^(T) W ^(T) W H)⁻¹ H ⁷ W ^(T) {right arrow over (b)}  (21)

W ε

^(N×N) is a diagonal matrix whose entry W(i, i)=w(x_(i),y_(i)). If a binary support map is used, i.e., all values of w(x,y) are either 0 or 1, the W matrix can be omitted, and H and {right arrow over (b)} are removed from all rows corresponding to pixels i for which w(x_(i), y_(i))=0. A support map may also be applied in similar fashion when solving for motion parameters using depth or intensity constraints only. The three support maps for these different constraint combinations do not need to be the same.

The motions estimated between individual pairs of frames are added together to form an estimate of cumulative object motion over time. It may be beneficial to supplement this tracking technique with another algorithm for determining when motion estimation has accumulated substantial error, and to reinitialize the object shape estimate at these times.

In a preferred embodiment of the invention, velocities of the visible points on the figure can be translated into rotations and translations of the figure and its limbs relative to the world coordinates, using twist mathematics. The brightness and depth constraint equations, Equations 5 and 13, can be combined as follows: $\begin{matrix} {{- \begin{bmatrix} {B_{t}\left( {x,y,t} \right)} \\ {Z_{t}\left( {x,y,t} \right)} \end{bmatrix}} = {\begin{bmatrix} {B_{x}\left( {x,y,t} \right)} & {B_{y}\left( {x,y,t} \right)} & {0} \\ {Z_{x}\left( {x,y,t} \right)} & {Z_{y}\left( {x,y,t} \right)} & {- 1} \end{bmatrix}\begin{bmatrix} v_{x} \\ v_{y} \\ v_{Z} \end{bmatrix}}} & (22) \end{matrix}$

This formulation gives 2N equations in terms of 3N unknown motion vectors (v_(x), v_(y), and v_(z) for each point) where N is the number of visible points on an articulated figure. Two of the vectors are in the image plane and the third is in the real world. In order to translate image-plane velocities into world-coordinate velocities, a camera model is employed. Using a perspective camera model and assuming that the origin of the world coordinate system is at the camera and the z-axis is along the viewing axis of the camera, so that ${x = {f\frac{X}{Z}}},\;{{{and}\mspace{20mu} y} = {f\frac{Y}{Z}}},$ results in: $\begin{matrix} {\begin{bmatrix} v_{x} \\ v_{y} \\ v_{Z} \end{bmatrix} = {\begin{bmatrix} \frac{f_{x}}{Z} & 0 & {- \frac{x}{Z}} \\ 0 & \frac{f_{y}}{Z} & {- \frac{y}{Z}} \\ 0 & 0 & 1 \end{bmatrix}\;\begin{bmatrix} v_{X} \\ v_{Y} \\ v_{Z} \end{bmatrix}}} & (23) \end{matrix}$

This constraint simply changes the unknown parameters. The total is still 2N equations in terms of 3N unknowns (v_(x), v_(y), and v_(z) for each point).

A twist ${\xi = \begin{bmatrix} v \\ \omega \end{bmatrix}},$ is a 6-element vector with the first 3 elements, v, indirectly representing the translation and the last three elements ω representing the axis (and sometimes the amount) of rotation. As a matter of convention, if the twist is used with an explicit scaling term θ, then |ω|=1; otherwise, the magnitude of ω is set according to the amount of rotation. The twist can be used to form a 4×4 matrix, through the operation of the “hat operator”: ${\xi = \begin{bmatrix} \hat{\omega} & v \\ 0 & 0 \end{bmatrix}},{{{where}\mspace{14mu}\hat{\omega}} = {\begin{bmatrix} 0 & {- \omega_{3}} & \omega_{2} \\ \omega_{3} & 0 & {- \omega_{1}} \\ {- \omega_{2}} & \omega_{1} & 0 \end{bmatrix}.}}$

When exponentiated, this 4×4 matrix gives the rotation/translation matrix $e^{\xi\theta} = \begin{bmatrix} e^{\hat{\omega}\theta} & p \\ 0 & 1 \end{bmatrix}$ where e^({circumflex over (ω)}{circumflex over (θ)}) is the rotation and p=((I−e^({circumflex over (ω)}{circumflex over (θ)})){circumflex over (ω)}+ωω^(T)θ)v is the translation, which maps x, y and z to v.

Using twists, the world coordinates (q_(s)) of any point on the body can be expressed as a function of time, of the point's limb number (k), of the pose Parameters (ξ_(o) and θ), and of the point's limb-centric coordinates (q_(b)): q_(s)(t)=g_(sb)(ξ₀(t),θ(t)|k,ξ₁ . . . ξ_(K−1))q_(b) where K is the number of articulated limbs in the figure. The mapping from limb-centric coordinates to world coordinates is done by translation/rotation as dictated by a “reference configuration” for the k^(th) limb, g_(sk)(0); by the translations/rotations e^(ξ) ¹ ^(θ) ¹ . . . e^(ξ) ^(k−1) ^(θ) ^(k−1) introduced by the joints along the articulated chain up to the k^(th) limb; and by the translations/rotations e^(ξ0) from the camera to the figure's torso. The parameters ξ₁ to ξ_(K−1) define the position of each joint on the figure relative to its reference joint, e.g. the elbow relative to the shoulder, the wrist relative to the elbow, etc.

Each limb's reference configuration gives the translation and rotation from that limb's coordinate system to the world coordinate system, when the body is positioned at ξ₀=0 and when all of the joint angles are zero. The extra degrees of freedom given by the reference configuration simplifies the task of describing the geometry of the articulated joint locations. Given a specific pose, the transformation from the limb's coordinate frame to the world coordinate frame is: $\begin{matrix} {\left. {{{g_{sb}\left( {{\xi_{0}(t)},{\theta(t)}} \right.}k},\xi_{1},\ldots\mspace{11mu},\xi_{K - 1}} \right) = {e^{\xi 0}e^{\xi_{1}\theta_{1}}\ldots\mspace{11mu} e^{\xi_{k - 1}\theta_{k - 1}}{g_{sk}(0)}}} & (24) \end{matrix}$ For notational simplicity hereinafter, g_(sb)(ξ₀(t),θ(t)|k,ξ₁, . . . , ξ_(K−1)) will be identified as g_(sb).

Using this description of the world coordinates of each body point in terms of the articulated-pose parameters, the world velocities can be related to the rotations and translations of the K coordinate frames that are tied to the K limbs of the figure. Since q_(S)(t)=g_(sb)q_(b) and q_(b) is independent of time: $\begin{matrix} {\begin{bmatrix} v_{X} \\ v_{Y} \\ v_{Z} \\ 0 \end{bmatrix} = {{\frac{\mathbb{d}}{\mathbb{d}t}{q_{s}(t)}} = {\frac{\partial}{\partial t}g_{sb}q_{b}}}} \\ {= {\left( {\frac{\partial}{\partial t}g_{sb}} \right)\left( {g_{sb}^{- 1}{q_{s}(t)}} \right)}} \\ {= {\left( {\frac{\partial}{\partial t}g_{sb}g_{sb}^{- 1}} \right){q_{s}(t)}}} \\ {= {{\hat{V}}_{sb}^{s}{q_{s}(t)}}} \end{matrix}$

The second line of the above identity is derived from the inverse of the identity q_(s)(t)=g_(sb)q_(b). The third line is by definition: {circumflex over (V)}_(sb) ^(s)=ġ_(sb)g_(sb) ⁻¹ is a 4×4 matrix describing the motion of the k^(th) limb's coordinate frame relative to the world coordinate frame, in terms of world coordinates. Using {circumflex over (V)}_(sb) ^(s), a 6=1 vector, to describe this coordinate transformation makes use of the special structure g_(sb)g_(sb) ⁻¹. Specifically, the first three rows and columns of ĝ_(sb)g_(sb) ⁻¹are skew symmetric and the bottom row is all zeros. q_(s)(t)=[q_(x)q_(y)q_(z)1]^(T) is the homogenous world coordinates of the body point at time t. More generally, q_(x), q_(y), and q_(z) are the coordinates of the point within a coordinate system that is tied to the world coordinate system by some known translation and rotation. Reformulating the above equation, $\begin{matrix} {\begin{bmatrix} v_{X} \\ v_{Y} \\ v_{Z} \end{bmatrix} = {\begin{bmatrix} 1 & 0 & 0 & 0 & q_{Z} & {- q_{Y}} \\ 0 & 1 & 0 & {- q_{Z}} & 0 & q_{X} \\ 0 & 0 & 1 & q_{Y} & {- q_{X}} & 0 \end{bmatrix}V_{sb}^{s}}} & (25) \end{matrix}$

Hence, the X-,Y- and Z-axis motion of each point on the body is obtained by multiplying the 6 motion parameters for each limb by the matrix. At this point, each limb has been forced to be internally rigid. This reduces the number of unknown parameters down to 6 parameters per limb (the 6 elements of V_(sb) ^(s) for that limb). There are now 2N equations in terms of 6K unknowns, where K is the number of articulated limbs.

The solution is further constrained by taking advantage of the interconnections between limbs. To do this, V_(sb) ^(s) for the k^(th) limb is described in terms of the articulated-pose parameters: $\begin{matrix} {V_{sb}^{s} = {V_{sO}^{s} + {\sum\limits_{i = 1}^{k}\;{{J_{{i - 1},i}^{s}\left( \theta_{i} \right)}{\overset{.}{\theta}}_{i}}}}} & (26) \end{matrix}$ where V_(s0) ^(s) is the velocity due to the motion of the body relative to the world coordinates and the Jacobian value J_(I−1,i) ^(s) (θ_(i)) θ_(i) is the velocity due to the motion of the i^(th) joint along the articulated chain to the k^(th) limb. Using the identity {circumflex over (V)}_(sb) ^(s)=ġ_(sb) ⁻¹ provides: $\begin{matrix} {{{\hat{J}}_{{i - 1},i}^{s}\left( \theta_{i} \right)} = {\left( {\frac{\partial}{\partial\theta_{i}}g_{sb}} \right)g_{sb}^{- 1}}} \\ {= {e^{\xi 0}e^{\xi_{1}\theta_{1}}\ldots\mspace{11mu} e^{\xi_{i - 1}\theta_{i - 1}}\xi_{i}e^{{- \xi_{i - 1}}\theta_{i - 1}}\ldots\mspace{11mu} e^{\xi_{1}\theta_{1}}e^{- {\xi 0}}}} \end{matrix}$

Thus, six parameters are employed for the torso, but all other limbs are reduced to one degree of freedom θ for each limb. To simplify this further, the adjoint of a rotation/translation matrix, ${g = \begin{bmatrix} R & p \\ 0 & 1 \end{bmatrix}},$ is defined as ${{Adj}(g)} = {\begin{bmatrix} R & {\hat{p}R} \\ 0 & R \end{bmatrix}.}$

Using this definition, gξg⁻¹=(Adj(g)ξ)^, where ( )^means that the hat operator is applied to the vector contained within the parentheses.

Using this identity, J_(i−1,i) ^(s)(θ_(i))=Adj (e^(ξ0)e^(ξ) ¹ ^(θ) ¹ . . . e^(ξ) ¹⁻¹ ^(θ) ¹⁻¹ )ξ_(i)  (27)

The velocity due to the motion of the figure relative to the world coordinates should allow for unconstrained rotations and translations. An easy way to do this is to express these motions in terms of the 4×4 transformation matrix, instead of in terms of the twist coordinates. ${{Let}\mspace{14mu} e^{\xi 0}} = {\begin{bmatrix} R_{0} & P_{0} \\ 0 & 1 \end{bmatrix}.}$ Then: $\begin{matrix} {{\hat{V}}_{s0}^{s} = {\left( {\frac{\mathbb{d}}{\mathbb{d}t}e^{\xi_{0}}} \right)e^{- \xi_{0}}}} \\ {= \begin{bmatrix} {{\overset{.}{R}}_{0}R_{0}^{T}} & {{- {\overset{.}{R}}_{0}}R_{0}^{T}p_{0}} & {+ {\overset{.}{p}}_{0}} \\ 0 & 0 & \; \end{bmatrix}} \end{matrix}$

This constraint is linear in terms of the unknowns (R₀ and p₀)but it is not tightly constrained. R₀ has 9 unknowns, instead of the 3 unknowns that can be used to describe a rotation or its derivative. This over-parameterization is corrected by noting that the first 3 rows/columns of {circumflex over (V)}_(s0) ^(S) must be skew symmetric. To capture this structure, the rotational component of the frame velocity is defined as ω_(v) ₀ =V^(S) _(s0,) =(R₀R₀ ^(T))^(v) where ( )^(V) is the inverse of the hat operator on the skew-symmetric matrix contained within the parentheses. It is significant to note that this is not a “small angle approximation” such as is often used for mapping a rotation matrix down onto its rotation axis. The identity ω_(v) ₀ =(R₀R₀ ^(T))^(V) is exact. The difference is that there is a special structure embedded in the derivative of a rotation matrix. The only way that an orthonormal matrix can transform into another orthonormal matrix is structured so that the derivative matrix times the transpose of the orthonormal matrix is a skew-symmetric matrix. Substituting and rearranging, the velocity of the torso is mapped back to the twists, with six degrees of freedom, as follows: $\begin{matrix} {V_{s_{0}}^{s} = {\begin{bmatrix} I & {\hat{p}}_{0} \\ 0 & I \end{bmatrix}\;\begin{bmatrix} {\overset{.}{p}}_{0} \\ \omega_{v_{0}} \end{bmatrix}}} & (28) \end{matrix}$

Once an estimate is obtained for ω_(v) ₀ (based on 2N linear constraint equations), it is translated into an estimate for R₀ by rearranging the defining equation: {dot over (R)} _(O)={circumflex over (ω)}_(V) _(O) R ₀ ^(−T)={circumflex over (ω)}_(V) _(O) R ₀  (29)

There are now 2N linear constraint equations in terms of K+5 unknowns ((ω_(v) ₀ , {dot over (p)}₀, {dot over (θ)}₁ through {dot over (θ)}_(k−1)) plus one auxiliary equation to remap ω_(v) ₀ back into R₀ Thus, a modified parameter set is employed to maintain linearity during the computations, and then mapped back to the original set non-linearly.

Discrete-time approximations to the time derivatives, R₀, P₀, and θ_(k−1) are then determined. A forward-difference approximation to the body-translation and joint-angle derivatives is used: {dot over (p)} ₀(t)→p ₀(t+1)−p ₀(t) {dot over (θ)}_(t)(t)→θ_(i)(t+1)−θ_(i)(t)  (30)

A forward-difference approximation to the body-rotation derivative R₀ is not desirable since using this approximation destroys the orthonormal structure of the rotation matrix R₀. Instead, a central-difference approximation is preferred: $\left. {{\overset{.}{R}}_{0}\left( {t + \frac{1}{2}} \right)}\rightarrow{{R_{0}\left( {t + 1} \right)} - {R_{0}(t)}} \right.$

Using this central difference approximation along with Equation 29 and a first-order linear interpolation for the half-sample delay, produces: $\begin{matrix} {{{{R_{0}\left( {t + 1} \right)} - {R_{0}(t)}} = {{\hat{\omega}}_{v_{0}}\left( \frac{{R_{0}(t)} + {R_{0}\left( {t + 1} \right)}}{2} \right)}}{{R_{0}\left( {t + 1} \right)} = {\left( {I - \frac{{\hat{\omega}}_{v_{0}}}{2}} \right)^{- 1}\left( {I + \frac{{\hat{\omega}}_{v_{0}}}{2}} \right){R_{0}(t)}}}} & (31) \end{matrix}$ so that

Combining Equations 22, 23, 25, 26, 27, 28 and 30 again results in 2N linear constraint equations in terms of K+5 unknowns. The difference is that the unknowns are now the updated parameters ω_(v) ₀ , p₀(t+1), θ₁(t+1) through θ_(K−1)(t+1)). These constraints are solved using least squares. Once that solution is obtained, Equation 31 provides the non-linear mapping from ω_(v) ₀ to R₀(t+1).

The quality of the above constraints depends on the accuracy of the first-order Taylor-series expansion used in the brightness and depth constraints. This first-order approximation often fails on large motions. Conventionally, this type of failure is compensated by estimating the motion, warping the images according to that motion estimate and repeating. This iterative estimation approach has several drawbacks. It is computationally expensive, requiring sample interpolation of the image being warped, re-computation of its spatial derivatives, and multiple formulations and solutions of the constraint equations at each time step. It introduces interpolation errors, both in the warped image values and in the spatial derivatives. Finally, for large motions, the initial motion estimates may actually point away from the true solution. The accuracy of the constraints can be improved without iteration, without interpolation, and without recomputing spatial derivatives, by allowing the focus of expansions (FOE) of each point to shift “independently” by some integer amount, (S_(x), S_(y)). Shifting the FOE by (S_(x), S_(y)), the constraints become: $\begin{matrix} {{{- \begin{bmatrix} {{B\left( {{x - S_{x}},{y - S_{y}},{t + 1}} \right)} - {B\left( {x,y,t} \right)}} \\ {{Z\left( {{x - S_{x}},{y - S_{y}},{t + 1}} \right)} - {Z\left( {x,y,t} \right)}} \end{bmatrix}} + {S_{x}\begin{bmatrix} {B_{x}\left( {x,y,t} \right)} \\ {Z_{x}\left( {x,y,t} \right)} \end{bmatrix}} + {S_{y}\begin{bmatrix} {B_{y}\left( {x,y,t} \right)} \\ {Z_{y}\left( {x,y,t} \right)} \end{bmatrix}}} \approx {\begin{bmatrix} {{B_{x}\left( {x,y,t} \right)}{B_{y}\left( {x,y,t} \right)}} & {0} \\ {{Z_{x}\left( {x,y,t} \right)}{Z_{y}\left( {x,y,t} \right)}} & {- 1} \end{bmatrix}\begin{bmatrix} v_{x} \\ v_{y} \\ v_{z} \end{bmatrix}}} & (32) \end{matrix}$

Equation 32 treats each constraint equation as if the t+1^(th) frame translated rigidly by (S_(x), S_(y)). As long as (S_(x), S_(y)) is integer valued, it is not necessary to interpolate the image. Since the equations assume rigid translation, there is no need to recompute the spatial derivatives of the t^(th) frame (as would be required to warp the t+1^(th) frame). Even though each individual constraint derived from Equation 32 acts as though the frame was rigidly translated, the set of constraints across the visible image does not have to share (S_(x), S_(y)) values. Instead, at each pixel, a new (S_(x), S_(y)) can be selected according to the expected shift for that pixel.

This provides the freedom to choose a distinct value (S_(x), S_(y)) for each visible point on the figure. This could be done within the traditional iterative motion estimation framework, by estimating the motion without shifting first to get an initial hypothesis for the image motion. Using that approach, the offset dictated for each pixel is rounded by the unshifted motion estimates to the nearest integer values, and those values are used for (S_(x), S_(y)) in Equation 32. The motion is then re-estimated according to the constraint equations generated by Equation 32. This process could be iterated as often as needed to converge to a stable motion estimate. It is more preferable, however, to use the cross correlations between times t and t+1 of the brightness and depth images. This cross correlation is evaluated for each limb separately, allowing a small number of 2D (image plane) translations and rotations. To avoid the overhead of image interpolation, zero-order hold can be used to provide non-zero rotations of the limbs. A nominal translation/rotation is selected for each limb, based on the peak of this cross correlation. Having selected a nominal translation/rotation of the FOEs for a limb, for each point on the limb the integer-valued offset is used for S_(x) and S_(y) nearest to the offset dictated by the selected translation/rotation. Again, S_(x) and S_(y) are preferably integers to reduce the computation and to avoid interpolation errors. Equation 32, with Equations 23, 25, 26, 27, 28 and 30, provides N brightness and N depth constraints, which can be solved with least squares, on K+5 unknowns (p₀(t+1), R_(O)(t+1), and θ₁(t+1) through θ_(K−1)(t+1)). From that solution, Equation 31 provides the non-linear mapping from ω_(v) ₀ to R₀(t+1).

Camera-centric coordinates are preferably used in the constraint Equation 23. However, any coordinate system can be used that is offset by a known rotation/translation from the camera coordinate system for the coordinates (q_(x), q_(y), q_(z)) used in Equation 25, to eliminate bias. To improve the conditioning of the constraint equation, the centroid of the visible figure is chosen as the origin of (q_(x), q_(y), q_(z)).

Any orientation/translation can be used as a reference configuration g_(sk)(0) in Equation 24. The following discussion explains a preferred way to use this freedom to avoid estimation errors due to cross coupling between the body position and the body rotation estimates.

Equation 28 includes cross coupling between the estimates for {dot over (P)}₀ and ω_(v) ₀ according to the size of p₀. Based on the derivations and simulations, for figures that change orientation relative to the camera, this coupling term should be present. The desirability of this coupling term is not apparent in simulations until the figure changes orientation relative to the camera. In simulations, when p₀ was non-zero and the figure was rotating relative to the camera, this resulted in a bias in the estimates of {dot over (p)}₀. The error resulting from this bias increases linearly over time, so its effects become more detrimental as the sequence of video images gets longer.

This bias is avoided by re-parameterizing the twists, at each time step, so that p₀=0. This can be done without affecting the coordinate-system origin for (q_(x), q_(y), q_(z)) by adjusting g_(Sk)(0), the reference configurations for the limbs (see Equation 24). This allows the conditioning of the constraints to be improved (as previously described) while still avoiding coupling.

To remove this coupling without altering the articulated figure's geometry, $\left\lbrack \left. \quad\begin{matrix} {\omega_{i} \times R_{0}^{T}p_{0}} \\ 0 \end{matrix} \right\rbrack \right.$ is subtracted from each internal joint $\xi_{i} = {\begin{bmatrix} v_{i} \\ \omega_{i} \end{bmatrix}\mspace{14mu}{\left( {i \geq 1} \right).}}$ (An offset of R₀ ^(T)p₀ is implicitly added to the last column of g_(sk)(0). However, since g_(sk)(0) never actually appears in the final constraint equations, this offset is more conceptual than computational.) This maintains the original geometry since, if exp $\left( {\begin{bmatrix} v_{i} \\ \omega_{i} \end{bmatrix}\theta_{i}} \right) = {\begin{bmatrix} R_{i} & p_{i} \\ 0 & 1 \end{bmatrix}\mspace{14mu}{then}}$ $\begin{matrix} {{\mathbb{e}}^{{\lbrack\begin{matrix} {{v_{i}\theta_{i}} - {({\omega_{i}\theta_{i} \times R_{0}^{T}p_{0}})}} \\ {\omega_{i}\theta_{i}} \end{matrix}\rbrack}\hat{}} = \begin{bmatrix} {{R_{i}p_{i}} + {R_{0}^{T}p_{0}}} & {{- R_{i}}R_{0}^{T}p_{0}} \\ 0 & 1 \end{bmatrix}} \\ {= {{\begin{bmatrix} I & {R_{0}^{T}p_{0}} \\ 0 & 1 \end{bmatrix}\begin{bmatrix} R_{i} & p_{i} \\ 0 & 1 \end{bmatrix}}\begin{bmatrix} I & {{- R_{0}^{T}}p_{0}} \\ 0 & 1 \end{bmatrix}}} \end{matrix}$ so that $\begin{matrix} {g_{s0} = {\begin{bmatrix} r_{0} & p_{0} \\ 0 & 1 \end{bmatrix}{\mathbb{e}}^{\xi_{1}\theta_{1}}\mspace{14mu}\ldots\mspace{14mu}{\mathbb{e}}^{\xi_{k - 1}\theta_{k - 1}}{g_{sk}(0)}}} \\ {= {\left( {\begin{bmatrix} R_{0} & p_{0} \\ 0 & 1 \end{bmatrix}\begin{bmatrix} I & {{- R_{0}^{T}}p_{0}} \\ 0 & 1 \end{bmatrix}} \right)\left( {\begin{bmatrix} I & {R_{0}^{T}p_{0}} \\ 0 & 1 \end{bmatrix}{{\mathbb{e}}^{\xi_{1}\theta_{1}}\begin{bmatrix} I & {{- R_{0}^{T}}p_{0}} \\ 0 & 1 \end{bmatrix}}} \right)\mspace{14mu}\ldots}} \\ {{~~~~~~~}{\left( {\begin{bmatrix} I & {R_{0}^{T}p_{0}} \\ 0 & 1 \end{bmatrix}{{\mathbb{e}}^{\xi_{k}\theta_{k}}\begin{bmatrix} I & {{- R_{0}^{T}}p_{0}} \\ 0 & 1 \end{bmatrix}}} \right)\left( {\begin{bmatrix} I & {R_{0}^{T}p_{0}} \\ 0 & 1 \end{bmatrix}{g_{sb}(0)}} \right)}} \\ {= {\begin{bmatrix} R_{0} & 0 \\ 0 & 1 \end{bmatrix}{\mathbb{e}}^{{\lbrack\begin{matrix} {{\xi_{1}\theta_{1}} - {({\omega_{1}\theta_{1} \times R_{0}^{T}p_{0}})}} \\ {\omega_{1}\theta_{1}} \end{matrix}\rbrack}\hat{}}\mspace{14mu}\ldots\mspace{14mu}{\mathbb{e}}^{\lbrack\begin{matrix} {{\xi_{k - 1}\theta_{k - 1}} - {({\omega_{k - 1}\theta_{k - 1} \times R_{0}^{T}p_{0}})}} \\ {\omega_{k - 1}\theta_{k - 1}} \end{matrix}\rbrack}}} \\ {\left( {{g_{sb}(0)} + \begin{bmatrix} 0 & {R_{0}^{T}p_{0}} \\ 0 & 0 \end{bmatrix}} \right)} \end{matrix}$

When these transformations are used to remove the cross-coupling between {dot over (p)}_(o) and ω_(v) ₀ , {dot over (p)}₀ also needs to be transformed back to the original coordinate system. This is done by setting p₀(t_(I))={dot over (p)}₀+R₀(t+1)R_(O) ^(T)(t)p₀(t).

In accordance with a second aspect of the invention, the dense depth data can be employed in conjunction with a shape model to estimate the pose of an articulated figure. As in the previous approach which employs the constraint equations, a figure is tracked by incrementally estimating its pose at regular intervals, e.g. for each video frame. In other words, sequential state estimation is employed to obtain the figure's pose.

State estimation is the process of determining a set of parameters for a given model that best accounts for a set of observations within the realm of that which can be expected. More specifically, the state estimation finds the most probable sequence of states given a set of observations and a set of expectations, in other words the sequence of states with the maximum a posteriori probability. However, since real image data attained from the video cameras are subject to noise and occlusions, the observations will generally have some erroneous or missing elements. In order to alleviate the effects of these imperfections on the results, the process of maximizing the agreement of the observations with a model is refined by considering a priori expectations, such as smooth motions or bounded accelerations or velocities. As a result, the process is generalized to minimizing a residual, where the residual takes into the account the agreement or correlation of a proposed state with the observations, as well as some measure of the unexpectedness or innovation of the proposed state, based on past history.

A more detailed block diagram of the image processing portion of the system for estimating pose of an articulated figure in accordance with this aspect of the invention is illustrated in FIG. 2. A model 20 is constructed for the figure whose pose is to be estimated. A state generator 22 produces a hypothesis for the pose, or state, which is applied to the model to generate an expected input 24. This expected input is compared with the actual input, i.e. the dense depth data from the range processor 16, in a comparator 26. The errors between the expected input and the actual input are then applied to the state generator 22. A new hypothesized state is then generated, in an effort to reduce the error. This process continues in a recursive manner, until the residual error has been minimized. At this point, a set of output parameters 28 are produced, as an estimate of the figure's pose.

The model 20 consists of a set of connected planar patches, each of which is in the shape of the convex hull of two circles. FIG. 3 a illustrates one such patch, which corresponds to a segment of the figure, e.g. a limb. The radius (r) and three-dimensional location (x,y,z) of each circle are variable parameters, which are estimated by the state generator 22. The connectivity of the patches is fixed, and provided by the user. For example, FIG. 3 b illustrates two patches that respectively correspond to two limbs that share a common joint, e.g. the upper arm and forearm of a person. At the joint, the circles of the two patches coincide in the two-dimensional image plane of the camera 12 a. The visible surface of each articulated segment of the figure is modeled by a single patch, such as that shown in FIG. 3 a. Each surface patch S_(k)=S_((ij))), and is defined by two nodes n_(i), n_(j) at its ends. Each node is specified by four scalar values (x_(i), y_(i), z_(i), r_(i)), which indicate its location and size. Given the values for two adjacent nodes n_(i) and n_(j), the connecting model patch S_((ij)) is a region of a plane with a range map R_((ij)) that passes through the two points (x_(i), y_(i), z_(i)) and (x_(j), y_(j), z_(j)) but is otherwise parallel to the image plane. Thus, for each segment of the figure, there corresponds a windowed depth map. The set of these maps over all segments S_(k), where k ranges over the pairs (i,j) for which a segment exists, forms the complete state estimate against which the dense depth data from the processor 16 is compared. Within the comparator 26, a determination is made for each pixel u of each segment S_(k), of the correlation between the observed and expected inputs. This correlation is based the difference between the range I(u) that is observed on the actual input for the pixel, and the range R_(k)(u) that is predicted by the segment. Since there are likely to be errors in both the measurement and the model, the magnitude of the difference is compared against a finite threshold. Pixels whose difference values lie above or below the threshold are respectively identified as being far from or close to the surface. FIG. 4 illustrates an example of a threshold function for observed farness. In this case, a pixel which lies within the threshold, and is therefore considered to be close to the surface, is assigned an observed farness value of −1, whereas pixels which are far from the surface have a value of +1.

Since the surface patches of the model are planar, they have a uniform range across their widths, i.e., in a direction perpendicular to an axis intersecting the two nodes. However, for many three-dimensional objects, the measured range will vary across the width of the object, due to its thickness. This discrepancy could result in erroneous correlation results. Therefore, as a second measure, the correlation between the observed input and the estimated input is confined to an area near the boundary of a segment. A true segment boundary has pixels of the segment inside the boundary, and pixels pertaining to other structure outside the boundary. Hence, the depth value for pixels that are just inside the boundary should fit the segment model, and the depth of pixels just outside the boundary would not be expected to fit the model. FIG. 5 illustrates a function that can be employed for the expected farness of a pixel, based on these considerations. The abscissa of this graph represents the shortest distance from the pixel of interest (u) to the boundary of the segment. Hence, pixels which lie just outside the boundary have an expected farness value of +1, and those which lie just inside the boundary have an expected farness value of −1. The function goes to 0 at a predetermined distance from the boundary, since only those pixels which are relatively close to the boundary are of interest.

The correlation between the observed depth data and the expected state therefore comprises a sum over all segments, and over all pixels of a segment, of the observed farness and the expected farness.

To determine the estimate, the state generator 22 selects the set of two-dimensional parameters (x_(i), y_(i), r_(i)) for which the difference between the observed and estimated depth values, summed over all of the pixels for all of the figure segments, is a minimum. Preferably, this minimum is determined by using a least squares fit. The various hypotheses can be generated, for example, by starting with the state that was estimated for the previous frame, and then proposing new hypothesized states which have configurations that are close to those of the previous estimate. Since the pose estimates are updated at a fairly high rate, e.g., video frame rates, the object of interest is not expected to change size or position significantly from one estimate to the next. This can be taken into account during the generation of new hypotheses, by weighting those which are closet to the most recent estimate as more likely than those which are farther away.

FIG. 6 illustrates a method for estimating the pose of an articulated figure, in accordance with an embodiment of the invention. In this example, dense range data is obtained that describes the distance of points on a figure from a reference point (602). A focus of expansion (FOE) of the points on the figure is shifted by an integer value or amount in order to improve the accuracy of a constraint (depth or otherwise) (604). The dense range data is processed to estimate the pose of the figure (606).

From the foregoing, therefore, it can be seen that the present invention provides a mechanism for estimating the pose of an object from dense depth data. Of particular significance, the techniques of the present invention can be employed to estimate the pose of articulated objects, as well as solid objects. In one approach, the pose is estimated on the basis of the depth data alone, through the use of a model consisting of planar patches. A second approach dispenses with the need for a model, by using both depth and brightness data, in conjunction with appropriate constraint equations.

It will be appreciated by those of ordinary skill in the art that the present invention can be embodied in other specific forms without departing from the spirit or essential characteristics thereof. The presently disclosed embodiments are therefore considered in all respects to be illustrative, and not restrictive. The scope of the invention is indicated by the appended claims, rather than the foregoing description, and all changes that come within the meaning and range of equivalence thereof are intended to be embraced therein. 

1. A method for estimating the pose of an articulated figure, comprising the steps of: obtaining dense range data which describes the distance of points on the figure from a reference; shifting a focus of expansion of a point on the figure independently by an integer value; and processing said dense range data to estimate the pose of the figure.
 2. The method of claim 1 wherein the dense range data is processed in accordance with a set of depth constraints to estimate the pose.
 3. The method of claim 2 wherein said depth constraints are linear.
 4. The method of claim 2 further including the steps of obtaining brightness data from an image of the figure, and processing said brightness data in accordance with a set of linear brightness constraints to estimate the pose.
 5. The method of claim 2 wherein said depth constraints are represented by means of twist mathematics.
 6. The method of claim 1 wherein said dense range data is compared with an estimate of pose to produce an error value, and said estimate is iteratively revised to minimize said error.
 7. The method of claim 1 further including the steps of obtaining brightness data from an image of the figure, and processing said brightness data in accordance with a set of brightness constraints to estimate the pose.
 8. The method of claim 1, wherein shifting the focus of expansion improves an accuracy of a constraint.
 9. A method for estimating the pose of an object, comprising the steps of: obtaining dense range data which describes the distance of points on the object from a reference; shifting a focus of expansion of a point on the object independently by an integer value; and processing said dense range data in accordance with a set of linear depth constraints to estimate the pose of the object.
 10. The method of claim 9 wherein the object is articulated.
 11. The method of claim 10 wherein said depth constraints are represented by means of twist mathematics.
 12. The method of claim 11 further including the steps of mapping parameters which describe rotation and translation of the object to a set of linear parameters, solving for the depth constraints, and re-mapping back to the original parameters.
 13. The method of claim 10, wherein said reference comprises a location on the object, and the pose is estimated, at least in part, from the positions of points on the object relative to said location.
 14. The method of claim 9 further including the steps of obtaining brightness data from an image of the object, and processing said brightness data in accordance with a set of linear brightness constraints to estimate the pose.
 15. The method of claim 9, wherein an estimate of the pose of the object includes an estimate for each of the orientation and translational positions of the object, and further including the steps of decoupling the estimate of orientation from the estimate of translational position.
 16. The method of claim 9, wherein the pose of the object is estimated for each image in a sequence of images, and further including the step of selecting a rigid translation value for each point on the object from one image to the next.
 17. The method of claim 16, wherein said rigid translation value is an integer value.
 18. The method of claim 16, wherein the rigid translation values are different for different points on the object.
 19. A method for estimating the pose of an object appearing in a sequence of video images, comprising the steps of: obtaining dense brightness data for pixels in each of said video images; obtaining dense range data for pixels in each of said video images; determining an initial pose for the object in one of said video images; and estimating changes in at least one of the translational position and rotational orientation of the object for successive images, on the basis of said brightness data and said range data, shifting a focus of expansion of a point on the object independently by an integer to thereby estimate the pose of the object in successive images.
 20. The method of claim 19, wherein the object is articulated.
 21. The method of claim 19, wherein said estimates are obtained by means of linear constraint equations that are applied to said brightness data and said range data. 